FEEDBACK LIMITED OPPORTUNISTIC SCHEDULING AND ADMISSION CONTROL FOR ERGODIC RATE GUARANTEES OVER NAKAGAMI-m FADING CHANNELS
نویسندگان
چکیده
In this paper, we consider downlink transmission in a cellular wireless network, where a base station communicates with multiple mobile stations (MSs) over Nakagami-m fading channels. MSs are classified into two classes, and each class has its own minimum ergodic rate requirement. We propose an opportunistic scheduling and admission control scheme that aims at guaranteeing minimum ergodic rates for all MSs in the network. In order to maintain fairness among MSs in the same class and reduce the feedback load on the uplink of the network, our proposed scheme uses normalized SNR thresholds and exploits multiuser diversity with limited feedback. In our analysis, we give a formula by which we can easily check whether an incoming MS, who requests to join a class in the network, can be accepted or not. For accepted MSs in the network, we obtain the values of thresholds with which all MSs in the network can be guaranteed respective minimum ergodic rate requirements. Through numerical studies and simulations, we confirm the validity of our scheme and analysis, and show the usefulness of our scheme.
منابع مشابه
Bursty Traffic Meets Fading: A Cross-Layer Design Perspective∗
We study cross-layer optimization of transmitting bursty traffic over fading channels. A common theme is to exploit (rather than combat) channel variation and traffic burstiness. Specifically, for bursty data transmissions in CDMA networks, we identify the existence of a nontrivial predictive multi-access interference (MAI) temporal structure in such systems. The predictive MAI structure is uti...
متن کاملSelective Fair Scheduling over Fading Channels
Imposing fairness in resource allocation incurs a loss of system throughput, known as the Price of Fairness (PoF ). In wireless scheduling, PoF increases when serving users with very poor channel quality because the scheduler wastes resources trying to be fair. This paper proposes a novel resource allocation framework to rigorously address this issue. We introduce selective fairness: being fair...
متن کاملRobustness Results for Hierarchical Diff-EDF Scheduling upon Heterogeneous Real-Time Packet Networks
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been pr...
متن کاملOn Admission Control and Scheduling of Multimedia Burst Data for CDMA Systems
In order to support transmissions of multimedia data (high data rate and burst) with performance guarantees in a wideband CDMA system, it is crucial to design a judicious algorithm for burst data admission control and scheduling. However, in the current literature there are only simple techniques (such as first-come-first-served and equal sharing) suggested for tackling the problem. Indeed, the...
متن کاملHigh Utilization Guarantee for Hierarchical Diff-EDF Schedulers
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been pr...
متن کامل